On face-magic labelings of regular tesselations
نویسندگان
چکیده
Let G=(V,E,F) be an embedding of a graph and a,b,c belong to {0,1}. A labeling type (a,b,c) is assignment labels from the set {1,2,...,a|V|+b|E|+c|F|} so that each vertex receives labels, edge b face c no label used more than once. If weight every s-sided face, defined as sum with vertices edges border equal some fixed constant w(s), then said face-magic. We investigate face-magic labelings all three regular tessellations, finding (1,1,1) for square tilings hexagon on torus, special class triangle cylinder.
منابع مشابه
Magic labelings of regular graphs
Let G(V,E) be a graph and λ be a bijection from the set V ∪E to the set of the first |V |+ |E| natural numbers. The weight of a vertex is the sum of its label and the labels of all adjacent edges. We say λ is a vertex magic total (VMT) labeling of G if the weight of each vertex is constant. We say λ is an (s, d) -vertex antimagic total (VAT) labeling if the vertex weights form an arithmetic pro...
متن کاملVertex-magic labelings of regular graphs II
Previously the first author has shown how to construct vertexmagic total labelings (VMTLs) for large families of regular graphs. The construction proceeds by successively adding arbitrary 2-factors to a regular graph of order n which possesses a strong VMTL, to produce a regular graph of the same order but larger size. In this paper, we exploit this construction method. We are able to show that...
متن کاملOn magic labelings of honeycomb
BaEa, M., On magic labelings of honeycomb, Discrete Mathematics 105 (1992) 305-311. We deal with the problem of labeling the vertices, edges and faces of a hexagonal planar map in such a way that the label of a face and labels of vertices and edges surrounding that face add up to a fixed value.
متن کاملVertex magic total labelings of 2-regular graphs
A vertex magic total (VMT) labeling of a graph G = (V,E) is a bijection from the set of vertices and edges to the set of integers defined by λ : V ∪E → {1, 2, . . . , |V | + |E|} so that for every x ∈ V , w(x) = λ(x)+ ∑ xy∈E λ(xy) = k, for some integer k. A VMT labeling is said to be a super VMT labeling if the vertices are labeled with the smallest possible integers, 1, 2, . . . , |V |. In thi...
متن کاملZero-Sum Magic Labelings and Null Sets of Regular Graphs
For every h ∈ N, a graph G with the vertex set V (G) and the edge set E(G) is said to be h-magic if there exists a labeling l : E(G) → Zh\{0} such that the induced vertex labeling s : V (G) → Zh, defined by s(v) = ∑ uv∈E(G) l(uv) is a constant map. When this constant is zero, we say that G admits a zero-sum h-magic labeling. The null set of a graph G, denoted by N(G), is the set of all natural ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The art of discrete and applied mathematics
سال: 2023
ISSN: ['2590-9770']
DOI: https://doi.org/10.26493/2590-9770.1658.c96